Topological indices: their nature, mutual relatedness, and applications
نویسندگان
چکیده
منابع مشابه
Topological Indices: Their Nature, Mutual Relatedness, and Applications
During the last two decades a large number of numerical graph invariants (topological indices) have been defined and used for correlation analysis in theoretical chemisty, pharmacology, toxicology, and environmental chemistry. However, no systematic study has been undertaken to determine to what extent these indices are correlated with each other. In the present paper we have carried out a prin...
متن کاملConvex Hexagonal Systems and Their Topological Indices
Convex hexagonal systems (CHS) i. e., hexagonal systems with no bay regions are studied. Among CHS with a fixed number of hexagons, the species with minimal/maximal number of inlets have minimal/maximal or maximal/minimal values for a variety of vertex–degree-based topological indices. These extremal CHS are characterized. 1 Convex hexagonal systems In this paper we study a special class of hex...
متن کاملRelationship between topological indices and thermodynamic properties and of the monocarboxylic acids applications in QSPR
Topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is a delightful playground for the exploration of proof techniques in Discrete Mathematics and its results have applications in many areas of sciences. One of the useful indic...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling
سال: 1987
ISSN: 0270-0255
DOI: 10.1016/0270-0255(87)90594-x